A novel density deviation multi-peaks automatic clustering algorithm
نویسندگان
چکیده
Abstract The density peaks clustering (DPC) algorithm is a classical and widely used method. However, the DPC requires manual selection of cluster centers, single way calculation, cannot effectively handle low-density points. To address above issues, we propose novel deviation multi-peaks automatic method (AmDPC) in this paper. Firstly, new local-density use to measure relationship between data points cut-off distance ( $$d_c$$ d c ). Secondly, divide into multiple levels equally extract with higher distances each level. Finally, for multi-peak at levels, merge them according size difference deviation. We finally achieve overall by processing verify performance method, test synthetic dataset, real-world Olivetti Face respectively. simulation experimental results indicate that AmDPC can more has certain effectiveness robustness.
منابع مشابه
Clustering Sentences with Density Peaks for Multi-document Summarization
Multi-document Summarization (MDS) is of great value to many real world applications. Many scoring models are proposed to select appropriate sentences from documents to form the summary, in which the clustering-based methods are popular. In this work, we propose a unified sentence scoring model which measures representativeness and diversity at the same time. Experimental results on DUC04 demon...
متن کاملA Link Density Clustering Algorithm based on Automatically Selecting Density Peaks For Overlapping Community Detection
In this paper, we proposed a link density clustering method for overlapping community detection based on density peaks. We firstly use an extended cosine link distance metric to reflect the relationship of links. Then we introduce a clustering algorithm with fast search for solving the link clustering problem by density peaks with box plot strategy to determine the cluster centres automatically...
متن کاملDFC: Density Fragment Clustering without Peaks
The density peaks clustering (DPC) algorithm is a novel density-based clustering approach. Outliers can be spotted and excluded automatically, and clusters can be found regardless of the shape and of dimensionality of the space in which they are embedded. However, it still has problems when processing a complex data set with irregular shapes and varying densities to get a good clustering result...
متن کاملA Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm
Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...
متن کاملDensity Peaks Clustering with Differential Privacy
Density peaks clustering (DPC) is a latest and well-known density-based clustering algorithm which offers advantages for finding clusters of arbitrary shapes compared to others algorithm. However, the attacker can deduce sensitive points from the known point when the cluster centers and sizes are exactly released in the cluster analysis. To the best of our knowledge, this is the first time that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2022
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-022-00798-3